Computing the Rank of Incidence Matrix and the Algebraic Immunity of Boolean Functions

نویسنده

  • Deepak Kumar Dalai
چکیده

The incidence matrix between a set of monomials and a set of vectors in IF2 has a great importance in the study of coding theory, cryptography, linear algebra, combinatorics. The rank of these matrices are very useful while computing algebraic immunity(AI) of Boolean functions in cryptography literature [18, 7]. Moreover, these matrices are very sparse and well structured. Thus, for aesthetic reason finding the rank of these matrices is also very interesting in mathematics. In this paper, we have reviewed the existing algorithms with added techniques to speed up the algorithms and have proposed some new efficient algorithms for the computation of the rank of incidence matrix and solving the system of equations where the co-efficient matrix is an incidence matrix. Permuting the rows and columns of the incidence matrix with respect to an ordering, the incidence matrix can be converted to a lower block triangular matrix, which makes the computation in quadratic time complexity and linear space complexity. Same technique is used to check and computing low degree annihilators of an n-variable Boolean functions in faster time complexity than the usual algorithms. Moreover, same technique is also exploited on the Dalai-Maitra algorithm in [9] for faster computation. On the basis of experiments, we conjecture that the AI of n-variable inverse S-box is b √ nc+ d n b√nce− 2. We have also shown the skepticism on the existing fastest algorithm in [1] to find AI and lowest degree annihilators of a Boolean function.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Rank of Incidence Matrix and Algebraic Immunity of Boolean Functions

The incidence matrix between a set of monomials and a set of vectors in IF2 has a great importance in the study of coding theory, cryptography, linear algebra, combinatorics. The rank of these matrices are very useful while computing algebraic immunity(AI) of Boolean functions in cryptography literature [18, 7]. Moreover, these matrices are very sparse and well structured. Thus, for aesthetic r...

متن کامل

On the Resistance of Prime-variable Rotation Symmetric Boolean Functions against Fast Algebraic Attacks

Boolean functions used in stream ciphers should have many cryptographic properties in order to help resist different kinds of cryptanalytic attacks. The resistance of Boolean functions against fast algebraic attacks is an important cryptographic property. Deciding the resistance of an n-variable Boolean function against fast algebraic attacks needs to determine the rank of a square matrix of or...

متن کامل

Face Recognition Based Rank Reduction SVD Approach

Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...

متن کامل

Wilson wavelets for solving nonlinear stochastic integral equations

A new computational method based on Wilson wavelets is proposed for solving a class of nonlinear stochastic It^{o}-Volterra integral equations. To do this a new stochastic operational matrix of It^{o} integration for Wilson wavelets is obtained. Block pulse functions (BPFs) and collocation method are used to generate a process to forming this matrix. Using these basis functions and their operat...

متن کامل

On the Algebraic Immunity of Symmetric Boolean Functions

In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient algorithm for computing the algebraic immunity of a symmetric function. The existence of several symmetric functions with maximum algebraic immunity is proven. In this way, a new class of function which have good implem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013